Computational complexity theory

Results: 2049



#Item
391Genetic algorithms / Abstract algebra / Combinatorics / Permutation / Time complexity / Mutation / Computational complexity theory / Algorithm / NP-hard / Theoretical computer science / Applied mathematics / Mathematics

PowerPoint template for scientific poster

Add to Reading List

Source URL: skelk.sdf-eu.org

Language: English - Date: 2011-03-15 15:13:11
392Analysis of algorithms / SL / Randomized algorithm / Connectivity / NP-complete problems / Graph coloring / Theoretical computer science / Computational complexity theory / Applied mathematics

arXiv:0909.2005v1 [cs.DS] 10 SepDeterministic approximation for the cover time of trees Uriel Feige∗

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2009-09-10 14:01:15
393Randomized algorithm / Mathematics / Computational geometry / Coding theory / Applied mathematics / Finite fields / Theoretical computer science / Analysis of algorithms / Probabilistic complexity theory

CPS296.2 Geometric Optimization February 22, 2007 Lecture 13: 1-Center, 1-Median problems Lecturer: Pankaj K. Agarwal

Add to Reading List

Source URL: www.cs.duke.edu

Language: English - Date: 2007-04-05 11:46:26
394Cognition / Policy / Problem solving / Wicked problem / Neuropsychological assessment / Structural complexity theory / Computational complexity theory / Reduction / Design / Theoretical computer science / Applied mathematics / Mathematics

Policy Sciences), © Elsevier Scientific Publishing Company, Amsterdam--Printed in Scotland Dilemmas in a General Theory of Planning* H O R S T W. J. R I T T E L

Add to Reading List

Source URL: phobos.ramapo.edu

Language: English - Date: 2010-08-06 10:22:41
395Analysis of algorithms / Linear algebra / Computational complexity theory / Numerical linear algebra / Sparse approximation / Time complexity / Compressed sensing / Big O notation / Tree decomposition / Theoretical computer science / Mathematics / Applied mathematics

Nearly Linear-Time Model-Based Compressive Sensing Chinmay Hegde, Piotr Indyk, and Ludwig Schmidt Massachusetts Institute of Technology, Cambridge MA 02139, USA Abstract. Compressive sensing is a method for recording a

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2015-05-25 21:19:32
396Computational complexity theory / Analysis of algorithms / Tree traversal / Tree / B-tree / Rope / Time complexity / Randomized algorithm / Binary search tree / Theoretical computer science / Binary trees / Graph theory

Space-Efficient Parallel Algorithms for Combinatorial Search Problems? A. Pietracaprina1 , G. Pucci1 , F. Silvestri1 , and F. Vandin2 1 University of Padova, Dip. Ingegneria dell’Informazione, Padova, Italy

Add to Reading List

Source URL: www.itu.dk

Language: English - Date: 2015-01-07 05:01:30
397Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / Time complexity / Algorithm / Poisson distribution / SL / Theoretical computer science / Computational complexity theory / Applied mathematics

Randomized Loose Renaming in O(log log n) Time [Extended Abstract] ∗ †

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2015-04-30 10:34:00
398Concurrency control / Consensus / Probabilistic complexity theory / Algorithm / Synchronizer / Non-blocking algorithm / PP / Distributed computing / Randomized algorithm / Theoretical computer science / Computational complexity theory / Applied mathematics

Notes on Theory of Distributed Systems CS: Spring 2014 James Aspnes:02

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2014-05-02 18:02:39
399Systems theory / Problem solving / Cybernetics / Systems / Complex systems theory / Complexity / Systems science / Wicked problem / Computational complexity theory / Science / Knowledge / Ethology

Appears in Proceedings of the 2nd International Conference on Information and Communication Technologies for Sustainability (ICT4S’2014), Stockholm, Sweden, 24-27 August, 2014. © 2014. This work is licensed under the

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2014-06-17 10:34:58
400Operations research / NP-complete problems / Linear programming / Real algebraic geometry / Semidefinite programming / 2-satisfiability / Mathematical optimization / Constraint satisfaction problem / Constraint satisfaction / Theoretical computer science / Applied mathematics / Computational complexity theory

Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems Moses Charikar∗ Konstantin Makarychev∗†

Add to Reading List

Source URL: konstantin.makarychev.net

Language: English - Date: 2014-06-08 22:16:07
UPDATE